Upper and Lower Bounds in Exponential Tauberian Theorems
نویسندگان
چکیده
منابع مشابه
Upper and Lower Bounds in Exponential Tauberian Theorems
In this text we study, for positive random variables, the relation between the behaviour of the Laplace transform near infinity and the distribution near zero. A result of De Bruijn shows that E(e−λX) ∼ exp(rλ) for λ → ∞ and P (X ≤ ε) ∼ exp(s/ε) for ε ↓ 0 are in some sense equivalent (for 1/α = 1/β + 1) and gives a relation between the constants r and s. We illustrate how this result can be use...
متن کاملUpper and Lower Bounds of Eigenvalues: Mode-clamping Theorems*
Upper and lower bounds for the eigenvalues of three types of matrices M are established. If M is written as the sum of a diagonal matrix D plus a matrix A, the real parts of the eigenvalues of M must lie between the real parts of the neighboring diagonal elements of D, no matter how large the elements of A or how closely spaced the diagonal elements of D. One of the types—that representing one ...
متن کاملUpper and lower bounds of symmetric division deg index
Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...
متن کاملUpper and lower bounds for numerical radii of block shifts
For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
متن کاملLower Bounds and Upper Bounds for MaxSAT
This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local Search procedure (SLS) can be substantially improved when its search is init...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tbilisi Mathematical Journal
سال: 2009
ISSN: 1875-158X
DOI: 10.32513/tbilisi/1528768840